the direction of Professor Yahya Fathi.)

نویسندگان

  • Yahya Fathi
  • Girish Kulkarni
  • Mangesh Kulkarni
  • Stephen Roberts
چکیده

KULKARNI, GIRISH. A Tabu Search Algorithm for the Steiner Tree Problem. (Under the direction of Professor Yahya Fathi.) The Steiner Tree problem in graphs is an NP-hard problem having applications in many areas including telecommunication, distribution and transportation systems. We survey, briefly, a few exact methods and a few heuristic approaches that have been proposed for solving this problem. Further, we propose a tabu search algorithm whose key feature includes a neighborhood definition consisting of exchange of key paths. The algorithm is empirically tested by running computational experiments on problem sets, with known optimal values, that are available over the internet. The results from the tabu search are compared with the optimal values and with the results of a well-known heuristic procedure. The experimental results show that the tabu search algorithm is reasonably successful. It produces near-optimal solutions in the experiments conducted and performs better than the heuristic procedure. We also explore other avenues for future work and possible extensions to the tabu search algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

n-step MIR Functions: Facets for Finite and Infinite Group Problems

The n-step mixed integer rounding (MIR) functions are used to generate n-step MIR inequalities for (mixed) integer programming problems (Kianfar and Fathi, 2006). We show that these functions are sources for generating extreme valid inequalities (facets) for group problems. We first prove the n-step MIR function, for any positive integer n, generates two-slope facets for the infinite group prob...

متن کامل

Observation in Grounded Theory and Ethnography: What are the Differences?

Observation in Grounded Theory and Ethnography: What are the Differences? Tahereh Fathi Najafi, Robab Latifnejad Roudsari, Hossein Ebrahimipour, and Narjes Bahri PhD Student in Reproductive Health, Student Research Committee, Department of Midwifery, School of Nursing and Midwifery, Mashhad University of Medical Sciences, Mashhad, IR Iran Associated Professor, Evidence-Based Care Research Centr...

متن کامل

Measuring sense of place and identifying the effective components in the historical fabric of Tehran (Case study: The historical neighborhood of Imamzadeh Yahya)

Nowadays, the reduced sense of place, sense of belonging, and identity in inhabitants of many urban areas especially in historical contexts that are undergone extensive and disproportionate redevelopment are an important issue in dealing with these districts. This descriptive-analytical research explores the multidimensional concept of sense of place and identifies its constituent factors in th...

متن کامل

Algorithmic Strategies for the 3-Model Configuration Problem

The problem of designing telecommunication switching cabinets is referred to as the q-model configuration problem. The objective is to design and configure switching cabinets to match the pattern of customer demand such that the total number of insertions required to manufacture a given set of orders is minimized. We make refinements to existing heuristic procedures developed to solve the q-mod...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002